Embedding ladders and caterpillars into the hypercube

نویسندگان

  • Sergei L. Bezrukov
  • Burkhard Monien
  • Walter Unger
  • Gerd Wechsung
چکیده

We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the embeddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Ladders and Caterpillars into

We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the em-beddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.

متن کامل

Exact Wirelength of Embedding the Hypercubes into Cycle-of-ladders

Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm to compute the exact wirelength of embedding the hypercubes into cycle-of-ladders and prove its correctness.

متن کامل

Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength

We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.

متن کامل

Mapping Problem and Embedding of Various Networks into Hypercubes

The purpose of embedding (or mapping) is to minimize the communication overhead of parallel algorithms. It appears unlikely that an efficient exact technique of embedding a general guest graph in a general host graph with a minimum-dilation will ever be found. The Research in this area is concentrating on discovering efficient heuristic that find solution in most cases. This article is a survey...

متن کامل

Embedding of Hypercube into Cylinder

Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 83  شماره 

صفحات  -

تاریخ انتشار 1998